منابع مشابه
Relationships Between CCZ and EA Equivalence Classes and Corresponding Code Invariants
The purpose of this paper is to provide a brief survey of CCZ and EA equivalence for functions f : G → N where G and N are finite and N is abelian, and, for the case f : Zp → Zp , to investigate two codes derived from f , inspired by these equivalences. In particular we show the dimension of the kernel of each code determines a new invariant of the corresponding equivalence class. We present co...
متن کاملPartitioning networks into classes of mutually isolated nodes ?
Following the work of Newman, we model complex networks with random graphs of a given degree distribution. In particular we study the case where all vertices have exactly the same degree (random regular graphs). We survey some recent results on the problem of partitioning such a graph into the smallest possible number of classes of mutually isolated vertices, known in graph theory as the colora...
متن کاملPartitioning Patches into Test-equivalence Classes for Scaling Program Repair
Automated program repair is a problem of finding a transformation (called a patch) of a given incorrect program that eliminates the observable failures. It has important applications such as providing debugging aids, automatically grading assignments and patching security vulnerabilities. A common challenge faced by all existing repair techniques is scalability to large patch spaces, since ther...
متن کاملBounding Embeddings of VC Classes into Maximum Classes
One of the earliest conjectures in computational learning theory—the Sample Compression conjecture—asserts that concept classes (equivalently set systems) admit compression schemes of size linear in their VC dimension. To-date this statement is known to be true for maximum classes—those that possess maximum cardinality for their VC dimension. The most promising approach to positively resolving ...
متن کاملCCZ and EA equivalence between mappings over finite Abelian groups
CCZand EA-equivalence, which are originally defined for vectorial Boolean functions, are extended to mappings between finite abelian groups G and H. We obtain an extension theorem for CCZequivalent but not EA-equivalent mappings. Recent results in [1] are improved and generalized.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics of Communications
سال: 2012
ISSN: 1930-5346
DOI: 10.3934/amc.2012.6.95